About the Paterson-Wegman linear unification algorithm
نویسندگان
چکیده
منابع مشابه
Unifying Nominal Unification
Nominal unification is proven to be quadratic in time and space. It was so by two different approaches, both inspired by the Paterson-Wegman linear unification algorithm, but dramatically different in the way nominal and first-order constraints are dealt with. To handle nominal constraints, Levy and Villaret introduced the notion of replacing while Calvès and Fernández use permutations and sets...
متن کاملMatching with Multiplication and Exponentiation ( extended
So far unification or matching algorithms have been developped only for a small number of equational theories whose axioms are some combination of associativity, commutativity, “idempotence” and existence of a unit element [Kühner et al. 1977, Plotkin 1972, Siekmann 1975, Stickel 1975] We must also mention a small “arithmetic evaluation” theory by Plotkin [Plotkin 1972], the work of Huet on uni...
متن کامل32-35 Wegman Feature
ITE JOURNAL / FEBRUARY 2001 ALL OVER THE WORLD, ROAD safety appears to be considered a problem with many (social) consequences. Everywhere in the world people are trying to improve road safety. Yet, relevant literature contains many indications that road safety improvements are moving slowly. Several causes for this are given. First, the political priority is relatively low. Second, it is not w...
متن کاملThe Paterson-kelly Syndrome.
Dysphagia localized to the post-cricoid region occurring mainly in middle-aged women was first fully described in the papers of Paterson (1919) and Kelly (1919). Kelly noted an association with anaemia, superficial glossitis, and angular stomatitis, while Paterson remarked on " the not infrequent supervention of malignant disease at the mouth of the gullet." Vinson (1922) observed the developme...
متن کاملLazy Linear Combinatorial Unification
In this paper we deene a two-rule reduction system for the lazy computation of uniication on rst-order terms. The computation consists of a sequence of reductions which is almost linear with the size of the input. Every reduction transforms the problem into an equivalent one which is a better approximation of the solution. The approach is based on a combinatorial system which provides abstracti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1986
ISSN: 0022-0000
DOI: 10.1016/0022-0000(86)90003-6